Search results for "PATH ALGORITHM"

showing 2 items of 2 documents

A differential-geometric approach to generalized linear models with grouped predictors

2016

We propose an extension of the differential-geometric least angle regression method to perform sparse group inference in a generalized linear model. An efficient algorithm is proposed to compute the solution curve. The proposed group differential-geometric least angle regression method has important properties that distinguish it from the group lasso. First, its solution curve is based on the invariance properties of a generalized linear model. Second, it adds groups of variables based on a group equiangularity condition, which is shown to be related to score statistics. An adaptive version, which includes weights based on the Kullback-Leibler divergence, improves its variable selection fea…

Statistics and ProbabilityGeneralized linear modelStatistics::TheoryMathematical optimizationProper linear modelGeneral MathematicsORACLE PROPERTIESGeneralized linear modelSPARSITYGeneralized linear array model01 natural sciencesGeneralized linear mixed modelCONSISTENCY010104 statistics & probabilityScore statistic.LEAST ANGLE REGRESSIONLinear regressionESTIMATORApplied mathematicsDifferential geometry0101 mathematicsDivergence (statistics)MathematicsVariance functionDifferential-geometric least angle regressionPATH ALGORITHMApplied MathematicsLeast-angle regressionScore statistic010102 general mathematicsAgricultural and Biological Sciences (miscellaneous)Group lassoGROUP SELECTIONStatistics Probability and UncertaintyGeneral Agricultural and Biological SciencesSettore SECS-S/01 - Statistica
researchProduct

Optimal Paths on Urban Networks Using Travelling Times Prevision

2012

We deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to initial car densities on roads and traffic coefficients at junctions, forecasts the future traffic evolution, giving dynamical weights to a constrained 𝐾 shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure.

Mathematical optimizationTraffic congestion reconstruction with Kerner's three-phase theoryArticle SubjectComputer scienceFluid dynamic model; K shortest path algorithm; Travelling times previsionGeneral EngineeringTraffic simulationK shortest path algorithmMeasure (mathematics)lcsh:QA75.5-76.95Computer Science ApplicationsTraffic congestionFluid dynamic modelModeling and SimulationShortest path problemComputer Science::Networking and Internet Architecturelcsh:Electronic computers. Computer scienceTravelling times previsionDijkstra's algorithmConstrained Shortest Path FirstSimulationTraffic waveModelling and Simulation in Engineering
researchProduct